Repetition-Free Derivability from a Regular Grammar is NP-Hard
نویسنده
چکیده
We prove the NP-hardness of the problem whether a given word can be derived from a given regular grammar without repeated occurrence of any nonterminal.
منابع مشابه
Product-Free Lambek Calculus Is NP-Complete
In this paper we prove that the derivability problems for productfree Lambek calculus and product-free Lambek calculus allowing empty premises are NP-complete. Also we introduce a new derivability characterization for these calculi.
متن کاملComplexity of the Lambek Calculus and Its Fragments
• The Lambek calculus (denoted L) is a mathematical tool for formal language specification. It generates the class of all context-free languages without the empty word. • The Lambek calculus with empty antecedents (denoted L∗) generates the class of all context-free languages. • Proof nets provide a convenient criterion for derivability in L∗. • The derivability problems for L∗(\, /) and L(\, /...
متن کاملLambek calculus is NP-complete
We prove that for both the Lambek calculus L and the Lambek calculus allowing empty premises L∗ the derivability problem is NP-complete. It follows that also for the multiplicative fragments of cyclic linear logic and noncommutative linear logic the derivability problem is NP-complete.
متن کاملThe Lambek-Grishin Calculus Is NP-Complete
The Lambek-Grishin calculus LG is the symmetric extension of the non-associative Lambek calculus NL. In this paper we prove that the derivability problem for LG is NP-complete.
متن کاملLC Graphs for the Lambek Calculus with Product
L differs from L in that the rules •L and •R are prohibited in L. A wide variety of work has contributed to the search for an algorithm for sequent derivability in L and L including Girard (1987), Danos and Regnier (1989), Roorda (1991), Retore (1996), Penn (2005) and Carpenter and Morrill (2005). In contrast to this work, Pentus (2006) proved that sequent derivability in L is NP-complete, effe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1602.05555 شماره
صفحات -
تاریخ انتشار 2016